Component-based polygonal approximation of soft objects
نویسندگان
چکیده
We propose a new polygonal approximation method for soft objects. While the conventional polygonization methods decompose space into small-sized cells and compute many pieces of polygons for the cells, this new method polygonizes a soft object by smoothing an initial polygonal approximation using subdivision surface schemes. The initial polygonal approximation is generated by the union of the polygonal approximations of the components that constitute the soft object. Our method has many advantages over the conventional methods: faster computation time, regular-sized polygons, efficient robust results, and multiresolutional representation. These features will lead to an interactive modeling environment using soft objects as well as an efficient polygonal representation that is proper to be used in virtual reality and distributed environments.
منابع مشابه
Polygonal Approximation Based on Multi-Objective Optimization
In order to solve multiple constraints in the existing polygonal approximation algorithms of digital curves, a new algorithm is proposed in this article. Each control constraint is taken as the optimization objective respectively and the idea of multi-objective optimization is also applied. Vertex positions of the intermediate approximation polygon are represented by a binary sequence, and Hamm...
متن کاملHigh-Quality Polygonal Contour Approximation Based on Relaxation
An algorithm is proposed for extracting high quality polygonal contours from connected objects in binary images. This is can be useful for OCR algorithms working on scanned text. It is also particularly interesting for raster-to-vector conversion of engineering drawings or other types of line drawings, where simple contours (known as Freeman chains) are grossly inadequate. Our algorithm is base...
متن کاملSurvey on Polygonal Approximation Techniques for Digital Planar Curves
Polygon approximation plays a vital role in abquitious applications like multimedia, geographic and object recognition. An extensive number of polygonal approximation techniques for digital planar curves have been proposed over the last decade, but there are no survey papers on recently proposed techniques. Polygon is a collection of edges and vertices. Objects are represented using edges and v...
متن کاملModified Physical Optics Approximation for RCS Calculation of Electrically Large Objects with Coated Dielectric
The Radar Cross Section of a target plays an important role in the detection of targets by radars. This paper presents a new method to predict the bistatic and monostatic RCS of coated electrically large objects. The bodies can be covered by lossy electric and/or magnetic Radar Absorbing Materials (RAMs). These materials can be approximated by the Fresnel reflection coefficients. The pro...
متن کاملFast Algorithm for Multiple-objects Min- Problem
Fast algorithm for joint near-optimal approximation of multiple polygonal curves is proposed. It is based on iterative reduced-search dynamic programming introduced earlier for the minproblem of a single polygonal curve. The proposed algorithm jointly optimizes the number of line segments allocated to the different individual curves, and the approximation of the curves by the given number of se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computers & Graphics
دوره 25 شماره
صفحات -
تاریخ انتشار 2001